package cc.wsyw126.java.nowcoder.sword_offer;

/**
 * Created by Administrator on 2017/4/14.
 * 输入一棵二叉树，求该树的深度。从根结点到叶结点依次经过的结点（含根、叶结点）形成树的一条路径，最长路径的长度为树的深度。
 */
public class TreeDepth {
    public int TreeDepth(TreeNode root) {
        if (root == null) return 0;
        int leftCount = TreeDepth(root.left);
        int rightCount = TreeDepth(root.right);
        return leftCount>rightCount?leftCount+1:rightCount+1;
    }
}
